Two-dimensional substring indexing
نویسندگان
چکیده
منابع مشابه
Multi-Dimensional Substring Selectivity Estimation
With the explosion of the Internet, LDAP directories and XML, there is an ever greater need to evaluate queries involving (sub)string matching. In many cases, matches need to be on multiple attributes/dimensions, with correlations between the dimensions. EEective query optimization in this context requires good selectivity estimates. In this paper, we use multi-dimensional count-suux trees as t...
متن کاملA Frequent Max Substring Technique for Thai Text Indexing
i Declaration I declare that this thesis is my own account of my research and contains as its main content work which has not previously been submitted for a degree at any tertiary education institution. ii Acknowledgments I would like to take this opportunity to acknowledge and thank the following people and organizations that helped me to complete this thesis. First of all I would like to tha...
متن کاملOptimal Substring-Equality Queries with Applications to Sparse Text Indexing
We consider the problem of encoding a string of length n from an alphabet [0, σ − 1] so that access and substring-equality queries (that is, determining the equality of any two substrings) can be answered efficiently. A clear lower bound on the size of any prefix-free encoding of this kind is n log σ + Θ(log(nσ)) bits. We describe a new encoding matching this lower bound when σ ≤ nO(1) while su...
متن کاملTowards Optimal Two-Dimensional Indexing for Constraint Databases
We address the problem of indexing conjunctions of linear constraints with two variables. We show how containment and intersection selection problems for constraint databases can be reduced to the point location problem by using a dual transformation. The proposed representation is then used to develop an eecient secondary storage solution for one important particular indexing case.
متن کاملApproximation Techniques for Indexing Two-Dimensional Constraint Databases
Constraint databases have recently been proposed as a powerful framework to model and retrieve spatial data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. In this paper, we consider the indexing problem for objects represented by conjunctions of two-variable linear constraints and we a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00028-x